Entropy of graphs, semigroups and groups

نویسنده

  • Shmuel Friedland
چکیده

§0. Introduction Let X be a compact metric space and T : X → X is continuous transformation. Then the dynamics of T is a widely studied subject. In particular, h(T ) the entropy of T is a well understood object. Let Γ ⊂ X ×X be a closed set. Then Γ induces certain dynamics and entropy h(Γ). If X is a finite set then Γ can be naturally viewed as a directed graph. That is, if X = {1, ..., n} then Γ consists of all directed arcs i → j so that (i, j) ∈ Γ. Then Γ induces a subshift of finite type which is a widely studied subject. However, in the case that X is infinite, the subject of dynamic of Γ and its entropy are relatively new. The first paper treating the entropy of a graph is due to [Gro]. In that context X is a compact Riemannian manifold and Γ can be viewed as a Riemannian submanifold. (Actually, Γ can have singularities.) We treated this subject in [Fri1-3]. See Bullet [Bul1-2] for the dynamics of quadratic correspondences and [M-R] for iterated algebraic functions. The object of this paper is to study the entropy of a corresponding map induced by Γ. We now describe briefly the main results of the paper. Let X be a compact metric space and assume that Γ ⊂ X ×X is a closed set. Set Γ+ = {(xi)1 : (xi, xi+1) ∈ Γ, i = 1, ..., }. Let σ : Γ+ → Γ+ be the shift map. Denote by h(Γ) be the topological entropy of σ ∣Γ∞+ . It then follows that σ unifies in a natural way the notion of a (continuous) map T : X → X and a (finitely generated) semigroup or group of (continuous) transformations S : X → X. Indeed, let Ti : X → X, i = 1, ..., m, be m continuous transformations. Denote by Γ(Ti) the graphs corresponding to Ti, i = 1, ..., m. Set Γ = ∪1 Γ(Ti). Then the dynamics of σ is the dynamics of the semigroup generated by T = {T1, ..., Tm}. If T is a set of homeomorphisms and T −1 = T then the dynamics of σ is the dynamics of the group G(T ) generated by T . In particular, we let h(G(T )) = h(Γ) be the entropy of G(T ) using the particular set of generators T . For a finitely generated group G of homeomorphisms of X we define h(G) = inf T ,G=G(T ) h(G(T )).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Graphs Related to Green Relations of Finite Semigroups

In this paper we develop an analog of the notion of the con- jugacy graph of  nite groups for the  nite semigroups by considering the Green relations of a  nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a  nite semigroup S , we  first atte...

متن کامل

A graphical difference between the inverse and regular semigroups

In this paper we investigate the Green‎ ‎graphs for the regular and inverse semigroups by considering the‎ ‎Green classes of them‎. ‎And by using the properties of these‎ ‎semigroups‎, ‎we prove that all of the five Green graphs for the‎ ‎inverse semigroups are isomorphic complete graphs‎, ‎while this‎ ‎doesn't hold for the regular semigroups‎. ‎In other words‎, ‎we prove‎ ‎that in a regular se...

متن کامل

Entropy of a semigroup of maps from a set-valued view

In this paper, we introduce a new entropy-like invariant, named Hausdorff metric entropy, for finitely generated semigroups acting on compact metric spaces from a set-valued view and study its properties. We establish the relation between Hausdorff metric entropy and topological entropy of a semigroup defined by Bis. Some examples with positive or zero Hausdorff metric entropy are given. Moreov...

متن کامل

A generalization of zero-divisor graphs

In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores

متن کامل

On transitive Cayley graphs of groups and semigroups

We investigate Cayley graphs of semigroups and show that they sometimes enjoy properties analogous to those of the Cayley graphs of groups. c © 2003 Elsevier Science Ltd. All rights reserved.

متن کامل

Amenability of groups and semigroups characterized by‎ ‎configuration

In 2005, A. Abdollahi and A. Rejali, studied the relations betweenparadoxical decomposition and configuration for semigroups. In thepresent paper, we introduce one other concept of amenability typeon semigroups and groups which includes amenability of semigroupsand inner-amenability of groups. We have extend the previous knownresults to semigroups and groups satisfying this concept.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006